Asymptotic Analysis of Run-Length Encoding

نویسندگان

  • Nabil Zaman
  • Nicholas Pippenger
چکیده

Gallager and Van Voorhis have found optimal prefix-free codes κ(K) for a random variable K that is geometrically distributed: Pr[K = k] = p(1 − p) for k ≥ 0. We determine the asymptotic behavior of the expected length Ex[#κ(K)] of these codes as p → 0: Ex[#κ(K)] = log2 1 p + log2 log 2 + 2 + f ( log2 1 p + log2 log 2 )

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating the Asymptotic Variance with Batch Means

We show that there is no batch-means estimation procedure for consistently estimating the asymptotic variance when the number of batches is held fixed as the run length increases. This result suggests that the number of batches should increase as the run length increases for sequential stopping rules based on batch means.

متن کامل

A New Model-Free CuSum Procedure for Autocorrelated Processes

We present a new CuSum chart for monitoring shifts in the mean of autocorrelated data. The monitoring statistic is the plain cumulative sum of differences between the observations and the target value, and the control limits are a function of the asymptotic variance constant and target in-control average run length. Our method uses a variety of non-parametric techniques that are popular in the ...

متن کامل

Asymptotic Exponentiality of the Distribution of First Exit times for a Class of Markov Processes with Applications to Quickest Change Detection

We consider the first exit time of a nonnegative Harris-recurrent Markov process from the interval [0, A] as A → ∞. We provide an alternative method of proof of asymptotic exponentiality of the first exit time (suitably standardized) that does not rely on embedding in a regeneration process. We show that under certain conditions the moment generating function of a suitably standardized version ...

متن کامل

Asymptotic Exponentiality of First Exit Times for Recurrent Markov Processes and Applications to Changepoint Detection

We study asymptotic properties (as A →∞) of the first exit time from the interval [0, A] of a non-negative Harris-recurrent Markov process. It is shown that under certain fairly general conditions the limiting distribution of the suitably normalized first exit time is exponential E(1) and that the moment generating function converges to that of E(1). The method of proof is based on considering ...

متن کامل

Analysis for the Design of Simulation Experiments

This paper will be Chapter 13 in Simulation in the Elsevier series of Handbooks in Operations Research and Management Science, edited by Shane Henderson and Barry Nelson. Herein we discuss analysis for the design of simulation experiments. By that we mean, not the traditional (important) methods to design statistical experiments, but rather techniques that can be used, before a simulation is co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1504.04070  شماره 

صفحات  -

تاریخ انتشار 2015